regexp/syntax.parser.stack (field)

49 uses

	regexp/syntax (current package)
		parse.go#L95: 	stack       []*Regexp // stack of parsed expressions
		parse.go#L131: 		for _, re := range p.stack {
		parse.go#L191: 	p.stack = append(p.stack, re)
		parse.go#L206: 	n := len(p.stack)
		parse.go#L211: 	re1 := p.stack[n-1]
		parse.go#L212: 	re2 := p.stack[n-2]
		parse.go#L228: 	p.stack = p.stack[:n-1]
		parse.go#L286: 	n := len(p.stack)
		parse.go#L290: 	sub := p.stack[n-1]
		parse.go#L301: 	p.stack[n-1] = re
		parse.go#L349: 	i := len(p.stack)
		parse.go#L350: 	for i > 0 && p.stack[i-1].Op < opPseudo {
		parse.go#L353: 	subs := p.stack[i:]
		parse.go#L354: 	p.stack = p.stack[:i]
		parse.go#L368: 	i := len(p.stack)
		parse.go#L369: 	for i > 0 && p.stack[i-1].Op < opPseudo {
		parse.go#L372: 	subs := p.stack[i:]
		parse.go#L373: 	p.stack = p.stack[:i]
		parse.go#L950: 		p.stack = p.stack[:len(p.stack)-1]
		parse.go#L954: 	n := len(p.stack)
		parse.go#L958: 	return p.stack[0], nil
		parse.go#L1233: 	n := len(p.stack)
		parse.go#L1234: 	if n >= 3 && p.stack[n-2].Op == opVerticalBar && isCharClass(p.stack[n-1]) && isCharClass(p.stack[n-3]) {
		parse.go#L1235: 		re1 := p.stack[n-1]
		parse.go#L1236: 		re3 := p.stack[n-3]
		parse.go#L1240: 			p.stack[n-3] = re3
		parse.go#L1244: 		p.stack = p.stack[:n-1]
		parse.go#L1249: 		re1 := p.stack[n-1]
		parse.go#L1250: 		re2 := p.stack[n-2]
		parse.go#L1255: 				cleanAlt(p.stack[n-3])
		parse.go#L1257: 			p.stack[n-2] = re1
		parse.go#L1258: 			p.stack[n-1] = re2
		parse.go#L1270: 		p.stack = p.stack[:len(p.stack)-1]
		parse.go#L1274: 	n := len(p.stack)
		parse.go#L1278: 	re1 := p.stack[n-1]
		parse.go#L1279: 	re2 := p.stack[n-2]
		parse.go#L1280: 	p.stack = p.stack[:n-2]